#include <vector>
#include <iostream>
using namespace std;
void quicksort(int left,int right,vector<int>& a)
{
	int i = 0,j=right;
	if(left>=right)
		return;
	int privot = a[left];
	while(i!=j){
		while(a[j]>=privot&&i<j)
			j--;
		while(a[i]<=privot&&i<j)
			i++;
		if(i < j)
			swap(a[i],a[j]);
	}
	a[left] = a[i]; 
	a[i] = privot;
	quicksort(left,i-1,a);
	quicksort(i+1,right,a);
}
